On Subgraphs in Distance-Regular Graphs
نویسنده
چکیده
Terwilliger [15] has given the diameter bound d < (s 1)(k 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hypercube are the even polygons, the hypercubes and the doubled Odd graphs and proves this in the case of girth 4. We show that the only distance-regular subgraphs of a hypercube with girth 6 are the doubled Odd graphs. If the girth is equal to 8, then its valency is at most 12.
منابع مشابه
Distance-regular graphs without 4-claws
We determine the distance-regular graphs with diameter at least 3 and c2 ≥ 2 but without induced K1,4-subgraphs.
متن کاملSome Results on the Eigenvalues of Distance-Regular Graphs
In 1986, Terwilliger showed that there is a strong relation between the eigenvalues of a distance-regular graph and the eigenvalues of a local graph. In particular, he showed that the eigenvalues of a local graph are bounded in terms of the eigenvalues of a distance-regular graph, and he also showed that if an eigenvalue θ of the distance-regular graph has multiplicity m less than its valency k...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...
متن کاملFinding Planted Subgraphs with Few Eigenvalues using the Schur-Horn Relaxation
Extracting structured subgraphs inside large graphs – often known as the planted subgraph problem – is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant efforts have been directed towards the development of tractable procedures that succeed on specific families of problem instances. We propose a new computation...
متن کامل